MARS - A framework for minimizing the job execution time in a metacomputing environment
نویسندگان
چکیده
Utilizing a collection of workstations and supercomputers in a metacomputing environment does not only o er an enormous amount of computing power, but also raises new problems. The true potential of WAN-based distributed computing can only be exploited if the application-to-architecture mapping re ects the di erent processor speeds, network performances and the application's communication characteristics. In this paper, we present the Metacomputer Adaptive Runtime System MARS, a framework for minimizing the execution time of distributed applications on a WAN metacomputer. Work-load balancing and task migration is based on dynamic information on the processor load and network performance. Moreover, MARS uses accumulated statistical data on previous execution runs of the same application to derive an improved task-to-process mapping. Migration decisions are based on (1) the current system load, (2) the network load and (3) previously obtained application-speci c characteristics. Our current implementation supports C applications with MPI message passing calls, but the general framework is also applicable to other programming environments like PVM, PARMACS, and Express. Future Generation Computer Systems (FGCS), Elsevier Science B.V., Vol. 12 No. 1, 1996, pp. 87{99
منابع مشابه
An Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملProvably Optimal Task Migration Time Using Alternative Routing Paths
Early experiments in migrating task images from one node in a metacomputing environment to another have shown, that it is possible to achieve almost maximum data throughput in LAN networks. With WAN-connected metacomputers however, the time spent in the task migration is not negligible. Here, alternative routing paths must be used concurrently to reduce the total migration time. We present a pr...
متن کاملThe Effects of Security Choices and Limits in a Metacomputing Environment
It is anticipated that the introduction of metacomputing and distributed resource management mechanisms to the Internet and World Wide Web will make available to users and applications a large diversity of previously unavailable network and computing resources. New methods of managing the scheduling and allocation of distributed resources bring into focus new problems and approaches for managin...
متن کاملStatistical Prediction of Task Execution Times Through Analytic Benchmarking for Scheduling in a Heterogeneous Environment
In this paper, a method for estimating task execution times is presented, in order to facilitate dynamic scheduling in a heterogeneous metacomputing environment. Execution time is treated as a random variable and is statistically estimated from past observations. This method predicts the execution time as a function of several parameters of the input data, and does not require any direct inform...
متن کاملA Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Future Generation Comp. Syst.
دوره 12 شماره
صفحات -
تاریخ انتشار 1996